Parameterized Algorithms for Feedback Vertex Set
نویسندگان
چکیده
We present an algorithm for the parameterized feedback vertex set problem that runs in time O((2 lg k + 2 lg lg k + 18)n). This improves the previous O(max{12, (4 lg k)}n) algorithm by Raman et al. by roughly a 2 factor (n ∈ O(n) is the time needed to multiply two n × n matrices). Our results are obtained by developing new combinatorial tools and employing results from extremal graph theory. We also show that for several special classes of graphs the feedback vertex set problem can be solved in time cn for some constant c. This includes, for example, graphs of genus O(lg n).
منابع مشابه
Experimental Evaluation of Parameterized Algorithms for Feedback Vertex Set
Feedback Vertex Set is a classic combinatorial optimization problem that asks for a minimum set of vertices in a given graph whose deletion makes the graph acyclic. From the point of view of parameterized algorithms and fixed-parameter tractability, Feedback Vertex Set is one of the landmark problems: a long line of study resulted in multiple algorithmic approaches and deep understanding of the...
متن کاملImproved Exact Exponential Algorithms for Vertex Bipartization and Other Problems
We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most 4. Our main results include: 1. an O(1.9526) 1 algorithm for Vertex Bipartization problem in undirected graphs; 2. an O(1.8384) algorithm for Vertex Bipartization problem in undirected graphs of maximum degree 3; 3. an O(1.945...
متن کاملFPT Algorithms for Connected Feedback Vertex Set
We study the recently introduced Connected Feedback Vertex Set (CFVS) problem from the view-point of parameterized algorithms. CFVS is the connected variant of the classical Feedback Vertex Set problem and is defined as follows: given a graph G = (V, E) and an integer k, decide whether there exists F ⊆ V , |F | ≤ k, such that G[V \ F ] is a forest and G[F ] is connected. We show that Connected ...
متن کامل0333 - 3590 Improved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). For unweighted graphs, our algorithm either constructs a feedback vertex set of size bounded by k in a given graph G, or reports that no such a feedback vertex set exists in G. For weighted graphs, our algorithm either constructs a minimum-...
متن کاملImproved Algorithms for the Feedback Vertex Set Problems
We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5kn). The algorithms construct a feedback vertex set of size bounded by k (in the weighted case this set is of minimum weight among the feedback vertex set of size at most k) in a given graph G, or reports that no such a feedback vertex set exist...
متن کاملStructural Parameterizations of Feedback Vertex Set
A feedback vertex set in an undirected graph is a subset of vertices whose removal results in an acyclic graph. It is well-known that the problem of finding a minimum sized (or k-sized in case of decision version of) feedback vertex set (FVS) is polynomial time solvable in (sub)-cubic graphs, in pseudo-forests (graphs where each component has at most one cycle) and mock-forests (graphs where ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004